On the number of subsequences with given sum
نویسنده
چکیده
Let G be an additive finite abelian p-group. For a given (long) sequence S in G and some element g ∈ G, we investigate the number of subsequences of S which have sum g. This refines some classical results of J.E. Olson and recent results of I. Koutis.
منابع مشابه
Partitioning Number Sequences into Optimal Subsequences
We consider how to partition finite sequences of positive numbers into subsequences such that each resulting subsequence has a sum of at least a given minimum. Given several different optimality criteria, based on maximising the number of subsequences and minimising their variance in size, we develop and analyse a series of algorithms that yield optimal solutions.
متن کاملOn the Number of m-term Zero-Sum Subsequences∗
A sequence S of terms from an abelian group is zero-sum if the sum of the terms of S is zero. In 1961 Erdős, Ginzburg and Ziv proved that any sequence of 2m− 1 terms from an abelian group of order m contains an m-term zero-sum subsequence [10]. This sparked a flurry of generalizations, variations and extensions [1] [3] [7] [8] [11] [13] [14] [15] [16] [17] [18] [22] [26] [27] [28] [37]. Since a...
متن کاملOn the number of zero-sum subsequences
For a sequence S of elements from an additive abelian group G, let f(S) denote the number of subsequences of S the sum of whose terms is zero. In this paper we characterize all sequences S in G with f(S) > 2|S|−2, where |S| denotes the number of terms of S. MSC Classification : Primary 11B50, Secondary 11B65, 11B75.
متن کاملOn the Number of Zero-sum Subsequences of Restricted Size
Let n = 2λm ≥ 526 with m ∈ {2, 3, 5, 7, 11}, and let S be a sequence of elements in Cn⊕Cn with |S| = n2 +2n−2. Let N 0 (S) denote the number of the subsequences with length n2(=|G|) and with sum zero. Among other results, we prove that either N 0 (S) = 1 or N |G| 0 (S) ≥ n2 + 1.
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 195 شماره
صفحات -
تاریخ انتشار 1999